Fractional Isomorphism of Graphons
نویسندگان
چکیده
We work out the theory of fractional isomorphism graphons as a generalization to classical finite graphs. The is given in terms homomorphism densities trees and it characterized distributions on iterated degree measures, Markov operators, weak conditional expectation with respect invariant sub-σ-algebras certain quotients graphons.
منابع مشابه
On the Isomorphism of Fractional Factorial Designs
Two fractional factorial designs are called isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and switching the levels of factors. To identify the isomorphism of two s-factor n-run designs is known to be an NP hard problem, when n and s increase. There is no tractable algorithm for the identification of isomorphic designs. In this paper, we propose...
متن کاملFinitely forcible graphons
We investigate families of graphs and graphons (graph limits) that are determined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turán, Erdős–Simonovits and Chung–Graham–Wilson, we construct numerous finitely forcible graphon...
متن کاملCentrality measures for graphons
Graphs provide a natural mathematical abstraction for systems with pairwise interactions, and thus have become a prevalent tool for the representation of systems across various scientific domains. However, as the size of relational datasets continues to grow, traditional graph-based approaches are increasingly replaced by other modeling paradigms, which enable a more flexible treatment of such ...
متن کاملCo-clustering of Nonsmooth Graphons
Performance bounds are given for exploratory co-clustering/ blockmodeling of bipartite graph data, where we assume the rows and columns of the data matrix are samples from an arbitrary population. This is equivalent to assuming that the data is generated from a nonsmooth graphon. It is shown that co-clusters found by any method can be extended to the row and column populations, or equivalently ...
متن کاملDistance and fractional isomorphism in Steiner triple systems
A.D. Forbes, M.J. Grannell and T.S. Griggs Department of Mathematics The Open University Walton Hall, Milton Keynes MK7 6AA UNITED KINGDOM [email protected] [email protected] [email protected] Abstract In [8], Quattrochi and Rinaldi introduced the idea of n−1 isomorphism between Steiner systems. In this paper we study this concept in the context of Steiner triple systems. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2022
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-021-4336-9